Constrained optimal fitting of three-dimensional vector patterns
نویسندگان
چکیده
منابع مشابه
Constrained optimal fitting of three-dimensional vector patterns
This paper addresses the problem of finding whether a given set of three-dimensional (3-D) vectors (the object) can be brought to match a second set of vectors (the template) by means of an affine motion, minimizing a measure of the mismatch error and satisfying an assigned set of geometrical constraints. This problem is encountered in many applications of computer vision, robotics, and manufac...
متن کاملConstrained fitting of three-point functions
The aim of this contribution is to illustrate the method of constrained curve fitting by application to three-point functions describing the semileptonic decay of heavy-light mesons. For a discussion of the method see [1]. The constraint method offers the chance to include knowledge about the fit parameters and generally results in very stable fits. This allows for much more ambitious fits than...
متن کاملThrust - Limited Optimal Three - Dimensional Spacecraft Trajectories
Several optimal three-dimensional orbital transfer problems are solved for thrust-limited spacecrafts using collocation and nonlinear programming techniques. The solutions for full nonlinear equations of motion are obtained where the integrals of the free Keplerian motion in three dimensions are utilized for coasting arcs. In order to limit the solution space, interior-point constraints are use...
متن کاملConstrained Three-Dimensional Codes
A n upper bound on t h e capacity of constrained three-dimensional codes is presented. T h e bound for two-dimensional codes of Calkin a n d Wilf was extended to three dimensions by Nagy a n d Zeger. Both bounds apply to first order symmetr ic constraints. T h e bound in three dimensions is generalized in a weaker form to higher order a n d non-symmetric constraints.
متن کاملAlphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns
We give an alphabet-independent optimal parallel algorithm for the searching phase of three-dimensional pattern-matching. All occurrences of a three dimensional pattern P of shape mmm in a text T of shape n n n are to be found. Our algorithm works in log m time with O(N= log(m)) processors of a CREW PRAM, where N = n 3. The ideas from 3] are used. Surprisingly, the extension of the two dimensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics and Automation
سال: 1998
ISSN: 1042-296X
DOI: 10.1109/70.720361